- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources3
- Resource Type
-
00030
- Availability
-
30
- Author / Contributor
- Filter by Author / Creator
-
-
Kobourov, Stephen (3)
-
Liotta, Giuseppe (3)
-
Angelini, Patrizio (1)
-
De Luca, Felice (1)
-
Di Giacomo, Emilio (1)
-
Didimo, Walter (1)
-
Eades, Peter (1)
-
Eppstein, David (1)
-
Hong, Seok-Hee (1)
-
Kindermann, Philipp (1)
-
Klein, Karsten (1)
-
Lubiw, Anna (1)
-
Maignan, Aude (1)
-
Mondal, Debajyoti (1)
-
Navarra, Alfredo (1)
-
Tappini, Alessandra (1)
-
Vosoughpour, Hamideh (1)
-
Whitesides, Sue (1)
-
Wismath, Stephen (1)
-
#Tyler Phillips, Kenneth E. (0)
-
- Filter by Editor
-
-
null (1)
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
null (Ed.)This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique. h-Clique2Path Planarity asks whether it is possible to obtain a planar subgraph of G by removing edges from each clique so that the subgraph induced by each subset is a path. We investigate the complexity of this problem in relation to k-planarity. In particular, we prove that h-Clique2Path Planarity is NP-complete even when h=4 and G is a simple 3-plane graph, while it can be solved in linear time when G is a simple 1-plane graph, for any value of h. Our results contribute to the growing fields of hybrid planarity and of graph drawing beyond planarity.more » « less
-
De Luca, Felice ; Di Giacomo, Emilio ; Didimo, Walter ; Kobourov, Stephen ; Liotta, Giuseppe ( , Journal of Graph Algorithms and Applications)
-
Eppstein, David ; Kindermann, Philipp ; Kobourov, Stephen ; Liotta, Giuseppe ; Lubiw, Anna ; Maignan, Aude ; Mondal, Debajyoti ; Vosoughpour, Hamideh ; Whitesides, Sue ; Wismath, Stephen ( , Algorithmica)